Layout Optimization for Distributed Relational Databases Using Machine Learning

.................................................................................................................................. 2 Acknowledgements ................................................................................................................. 4 LIST OF FIGURES ...................................................................................................................... 8 LIST OF TABLES ........................................................................................................................ 9 1. Introduction ................................................................................................................... 10 1.1. Motivation ............................................................................................................................. 10 1.2. The System ............................................................................................................................ 11 1.3. Research Questions ............................................................................................................ 12 1.4. Contributions ....................................................................................................................... 13 1.4.1. Main Assumptions ....................................................................................................... 14 1.4.2. Minimizing the Response Time of a Web-­‐based Application ....................... 17 1.4.3. State Based Search over Database Layouts ........................................................ 18 1.4.4. Machine Learned Rules ............................................................................................. 19 1.5. Dissertation Outline ........................................................................................................... 20 2. Related Work ................................................................................................................. 21 2.1. Overview ................................................................................................................................ 21 2.2. Review of Industry Research .......................................................................................... 22 2.3. Review of Academia Research ........................................................................................ 28 2.4. Hybrid Solutions ................................................................................................................. 39 3. Data Placement .............................................................................................................. 50 3.1. Current Techniques for Distributing Load ................................................................. 51 3.2. Data Placement Problem .................................................................................................. 55 3.3. Data Placement Solution .................................................................................................. 58 3.4. State Space Search over Layouts .................................................................................... 59 3.5. Horizontal Partitioning ..................................................................................................... 62 3.5.1. Operator and Framework Limitations ................................................................. 64 3.5.2. Database Constraints ................................................................................................. 66 3.5.3. Table Relationships .................................................................................................... 68 3.5.3.1. One-­‐to-­‐One ........................................................................................................................... 68 3.5.3.2. One-­‐to-­‐Many ........................................................................................................................ 69 3.5.3.3. Many-­‐to-­‐Many ..................................................................................................................... 69 3.5.4. Partitioning Rules ....................................................................................................... 70 3.5.4.1. Partitioning Table “A” ...................................................................................................... 70 3.5.4.2. Partitioning Table “A” and “B” Together .................................................................... 71 3.5.5. Partially Ordered Set .................................................................................................. 73 3.5.6. Hasse Diagram .............................................................................................................. 73 3.5.7. Maximal Element ......................................................................................................... 75 3.5.8. HP Key Search ............................................................................................................... 76 3.6. Vertical Partitioning .......................................................................................................... 78 3.6.1. Operator and Framework Limitations ................................................................. 79 3.6.2. VP Key Search ............................................................................................................... 80 3.7. Combined Vertical Partitioning ..................................................................................... 82